منابع مشابه
Randomness, lowness and degrees
We say that A ≤LR B if every B-random number isA-random. Intuitively this means that if oracle A can identify some patterns on some real !, oracle B can also find patterns on !. In other words, B is at least as good as A for this purpose. We study the structure of the LR degrees globally and locally (i.e., restricted to the computably enumerable degrees) and their relationship with the Turing d...
متن کاملRandomness, relativization and Turing degrees
We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is ?-random if it is Martin-L?f random relative to 0_1). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) > |x| ? c. The 'only if direction was obtained independently by Joseph Miller. This cha...
متن کاملRandomness and the linear degrees of computability
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤` β, previously denoted α ≤sw β) then β ≤T α. In fact, every random real satisfies this quasi-maximality property. As a corollary we may conclude that there exists no `-complete ∆2 real. Upon realizing that quasi-maximality does not characterize the random reals—there exist reals which are not rando...
متن کاملIndependence, Relative Randomness, and PA Degrees
We study pairs of reals that are mutually Martin-Löf random with respect to a common, not necessarily computable probability measure. We show that a generalized version of van Lambalgen’s Theorem holds for non-computable probability measures, too. We study, for a given real A, the independence spectrum of A, the set of all B so that there exists a probability measure μ so that μ{A,B} = 0 and (A...
متن کاملOn Initial Segment Complexity and Degrees of Randomness
One approach to understanding the fine structure of initial segment complexity was introduced by Downey, Hirschfeldt and LaForte. They define X ≤K Y to mean that (∀n) K(X n) ≤ K(Y n) + O(1). The equivalence classes under this relation are the K-degrees. We prove that if X ⊕ Y is 1-random, then X and Y have no upper bound in the K-degrees (hence, no join). We also prove that n-randomness is clos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1996
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.93.5.2083